Search Results

Documents authored by Bae, J.

Found 2 Possible Name Variants:

Bae, Crystal J.

Document
DOI: 10.4230/LIPIcs.COSIT.2019.24
Dyadic Route Planning and Navigation in Collaborative Wayfinding

Authors: Crystal J. Bae and Daniel R. Montello

Published in: LIPIcs, Volume 142, 14th International Conference on Spatial Information Theory (COSIT 2019)

Abstract
The great majority of work in spatial cognition has taken an individual approach to the study of wayfinding, isolating the planning and decision-making process of a single navigating entity. The study we present here expands our understanding of human navigation as it unfolds in a social context, common to real-world scenarios. We investigate pedestrian navigation by pairs of people (dyads) in an unfamiliar, real-world environment. Participants collaborated on a task to plan and enact a route between a given origin and destination. Each dyad had to devise and agree upon a route to take using a paper map of the environment, and was then taken to the environment and asked to navigate to the destination from memory alone. We video-recorded and tracked the dyad as they interacted during both planning and navigation. Our results examine explanations for successful route planning and sources of uncertainty in navigation. This includes differences between situated and prospective planning - participants often modify their route-following on the fly based on unexpected challenges. We also investigate strategies of social role-taking (leading and following) within dyads.
Cite as

Crystal J. Bae and Daniel R. Montello. Dyadic Route Planning and Navigation in Collaborative Wayfinding. In 14th International Conference on Spatial Information Theory (COSIT 2019). Leibniz International Proceedings in Informatics (LIPIcs), Volume 142, pp. 24:1-24:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2019)

Copy BibTex To Clipboard

@InProceedings{bae_et_al:LIPIcs.COSIT.2019.24,
  author =	{Bae, Crystal J. and Montello, Daniel R.},
  title =	{{Dyadic Route Planning and Navigation in Collaborative Wayfinding}},
  booktitle =	{14th International Conference on Spatial Information Theory (COSIT 2019)},
  pages =	{24:1--24:20},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-115-3},
  ISSN =	{1868-8969},
  year =	{2019},
  volume =	{142},
  editor =	{Timpf, Sabine and Schlieder, Christoph and Kattenbeck, Markus and Ludwig, Bernd and Stewart, Kathleen},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.COSIT.2019.24},
  URN =		{urn:nbn:de:0030-drops-111168},
  doi =		{10.4230/LIPIcs.COSIT.2019.24},
  annote =	{Keywords: Wayfinding, Navigation, Collaboration, Leadership, Conversation Analysis}
}

Bae, J.

Document
DOI: 10.4230/LIPIcs.SWAT.2020.33
Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem

Authors: S. Rathinam, R. Ravi, J. Bae, and K. Sundar

Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)

Abstract
We study a Multiple Depot Heterogeneous Traveling Salesman Problem (MDHTSP) where the cost of the traveling between any two targets depends on the type of the vehicle. The travel costs are assumed to be symmetric, satisfy the triangle inequality, and are monotonic, i.e., the travel costs between any two targets monotonically increases with the index of the vehicles. Exploiting the monotonic structure of the travel costs, we present a 2-approximation algorithm based on the primal-dual method.
Cite as

S. Rathinam, R. Ravi, J. Bae, and K. Sundar. Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 33:1-33:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)

Copy BibTex To Clipboard

@InProceedings{rathinam_et_al:LIPIcs.SWAT.2020.33,
  author =	{Rathinam, S. and Ravi, R. and Bae, J. and Sundar, K.},
  title =	{{Primal-Dual 2-Approximation Algorithm for the Monotonic Multiple Depot Heterogeneous Traveling Salesman Problem}},
  booktitle =	{17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)},
  pages =	{33:1--33:13},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-95977-150-4},
  ISSN =	{1868-8969},
  year =	{2020},
  volume =	{162},
  editor =	{Albers, Susanne},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.33},
  URN =		{urn:nbn:de:0030-drops-122805},
  doi =		{10.4230/LIPIcs.SWAT.2020.33},
  annote =	{Keywords: Approximation Algorithm, Heterogeneous Traveling Salesman Problem, Primal-dual Method}
}
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact